Nuprl Lemma : eqfun_p_subtyping
13,42
postcript
pdf
T
:Type,
P
:(
T
),
eq
:(
T
T
). IsEqFun(
T
;
eq
)
IsEqFun({
x
:
T
|
P
(
x
)} ;
eq
)
latex
Up
sets
1
Definitions of Statement
{
x
:
s
|
Q
(
x
) }
Definitions
t
T
,
IsEqFun(
T
;
eq
)
,
P
Q
,
,
x
:
A
.
B
(
x
)
,
x
(
s
)
,
P
&
Q
,
P
Q
,
x
f
y
,
P
Q
Lemmas
bool
wf
,
assert
wf
,
iff
functionality
wrt
iff
origin
T:Type, P:(T
), eq:(TT
). IsEqFun(T;eq) 
IsEqFun({x:T| P(x)} ;eq) T:Type, P:(T), eq:(TT). IsEqFun(T;eq) IsEqFun({x:T| P(x)} ;eq) 
T Qx:A. B(x)
Q Q